Solving Kepler’s equation with CORDIC double iterations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Dimensional CORDIC with reduced iterations

This paper describes a modification to the three dimensional CORDIC algorithm using an approximation of the Taylor series. The modification has the potential to reduce the number of iterations required for a three dimensional CORDIC operation by at least 25%. The approach used is based upon a modification of the two dimensional CORDIC algorithm originally suggested by H.M Ahmed[1]. Introduction...

متن کامل

Managing Problem-Solving Iterations in Product Development

Problem-solving is a useful way to view product development. In many cases, design teams iterate through a generate-test cycle until a successful design is found. The time required to find a successful design is influenced by the testing strategy. In particular, the amount of time spent generating a solution affects the probability of passing the test. This paper introduces a novel model of the...

متن کامل

Double Sequence Iterations for Strongly Contractive Mapping in Modular Space

In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.

متن کامل

Solving Upwind-biased Discretizations: Defect-correction Iterations

This paper considers defect-correction solvers for a second order upwind-biased discretization of the 2D convection equation. The following important features are reported 1. The asymptotic convergence rate is about 0.5 per defect-correction iteration. 2. If the operators involved in defect-correction iterations have different approximation order, then the initial convergence rates may be very ...

متن کامل

Averaging Asynchronously Using Double Linear Iterations∗

The distributed averaging problem is to devise a protocol which will enable the members of a group of n > 1 agents to asymptotically determine in a decentralized manner, the average of the initial values of their scalar agreement variables. A typical averaging protocol can be modeled by a linear iterative equation whose update matrices are doubly stochastic. Building on the ideas proposed in [1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 2020

ISSN: 0035-8711,1365-2966

DOI: 10.1093/mnras/staa2441